翻訳と辞書
Words near each other
・ Doxa Megalopoli
・ Doxa Nea Manolada F.C.
・ Doxa Pentalofos M.A.S.
・ Doxa Petroussa F.C.
・ Doxa S.A.
・ Doxa Vyronas F.C.
・ Doxacurium chloride
・ Doxander
・ Doxander campbelli
・ Doxander vittatus
・ Doxanthrine
・ Doxapatres Boutsaras
・ Doxapram
・ Doxaras
・ Doxastic attitudes
Doxastic logic
・ Doxastic voluntarism
・ Doxastikon
・ Doxato
・ Doxazosin
・ Doxbin
・ Doxefazepam
・ Doxepin
・ Doxercalciferol
・ Doxey
・ Doxey Marshes
・ Doxford
・ Doxford House
・ Doxford International Business Park
・ Doxford Park


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Doxastic logic : ウィキペディア英語版
Doxastic logic
Doxastic logic is a modal logic concerned with reasoning about beliefs. The term ''doxastic'' derives from the ancient Greek δόξα, ''doxa'', which means "belief." Typically, a doxastic logic uses 'Bx' to mean "It is believed that x is the case," and the set \mathbb denotes a set of beliefs. In doxastic logic, belief is treated as a modal operator.
::\mathbb: ,...,b_}
There is complete parallelism between a person who believes propositions and a formal system that derives propositions. Using doxastic logic, one can express the epistemic counterpart of Gödel's incompleteness theorem of metalogic, as well as Löb's theorem, and other metalogical results in terms of belief.〔Smullyan, Raymond M., (1986) (''Logicians who reason about themselves'' ), Proceedings of the 1986 conference on Theoretical aspects of reasoning about knowledge, Monterey (CA), Morgan Kaufmann Publishers Inc., San Francisco (CA), pp. 341-352〕
==Types of reasoners==
To demonstrate the properties of sets of beliefs, Raymond Smullyan defines the following types of reasoners:
* Accurate reasoner:〔〔http://cs.wwc.edu/KU/Logic/Book/book/node17.html Belief, Knowledge and Self-Awareness
〕〔
http://moonbase.wwc.edu/~aabyan/Logic/Modal.html Modal Logics
〕〔
Smullyan, Raymond M., (1987) ''Forever Undecided'', Alfred A. Knopf Inc.
〕 An accurate reasoner never believes any false proposition. (modal axiom T)
: \forall p: \mathcalp \to p
* Inaccurate reasoner:〔〔〔〔 An inaccurate reasoner believes at least one false proposition.
: \exists p: \neg p \wedge \mathcalp
* Conceited reasoner:〔〔 A conceited reasoner believes his or her beliefs are never inaccurate. A conceited reasoner will necessarily lapse into an inaccuracy.
: \mathcal(p: \neg p \wedge \mathcalp )
: or
: \mathcal(p: \mathcalp \to p )
* Consistent reasoner:〔〔〔〔 A consistent reasoner never simultaneously believes a proposition and its negation. (modal axiom D)
: \neg\exists p: \mathcalp \wedge \mathcal\neg p
: or
: \forall p: \mathcalp \to \neg\mathcal\neg p
* Normal reasoner:〔〔〔〔 A normal reasoner is one who, while believing p, also ''believes'' he or she believes p (modal axiom 4).
: \forall p: \mathcalp \to \mathcalp
* Peculiar reasoner:〔〔 A peculiar reasoner believes proposition p while also believing he or she does not believe p. Although a peculiar reasoner may seem like a strange psychological phenomenon (see Moore's paradox), a peculiar reasoner is necessarily inaccurate but not necessarily inconsistent.
: \exists p: \mathcalp \wedge \mathcalp
* Regular reasoner:〔〔〔〔 A regular reasoner is one who, while believing p \to q , also ''believes'' \mathcalp \to \mathcalq .
: \forall p: \forall q: \mathcal(p \to q) \to \mathcal (\mathcalp \to \mathcalq)
* Reflexive reasoner:〔〔 A reflexive reasoner is one for whom every proposition p has some q such that the reasoner believes q \equiv ( \mathcalq \to p) .
: \forall p:\exists q:\mathcal(q \equiv ( \mathcalq \to p))
:If a reflexive reasoner of type 4 (below ) believes \mathcalp \to p , he or she will believe p. This is a parallelism of Löb's theorem for reasoners.
* Unstable reasoner:〔〔 An unstable reasoner is one who believes that he or she believes some proposition, but in fact does not believe it. This is just as strange a psychological phenomenon as peculiarity; however, an unstable reasoner is not necessarily inconsistent.
: \exists p: \mathcal\mathcalp \wedge \neg\mathcalp
* Stable reasoner:〔〔 A stable reasoner is not unstable. That is, for every p, if he or she believes Bp then he or she believes p. Note that stability is the converse of normality. We will say that a reasoner believes he or she is stable if for every proposition p, he or she believes BBp→Bp (believing: "If I should ever believe that I believe p, then I really will believe p").
: \forall p: \mathcalp\to\mathcalp
* Modest reasoner:〔〔 A modest reasoner is one for whom every believed proposition p, \mathcalp \to p only if he or she believes p. A modest reasoner never believes Bp→p unless he or she believes p. Any reflexive reasoner of type 4 is modest. (Löb's Theorem)
: \forall p: \mathcal(\mathcalp \to p) \to \mathcalp
* Queer reasoner:〔 A queer reasoner is of type G and believes he or she is inconsistent—but is wrong in this belief.
* Timid reasoner:〔 A timid reasoner is afraid to believe p (he or she does not believe p ) if he or she believes \mathcalp \to \mathcal\bot

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Doxastic logic」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.